The Cyclic Antibandwidth Problem
نویسندگان
چکیده
The cyclic antibandwidth problem is to embed an n-vertex graph into the cycle Cn, such that the minimum distance (measured in the cycle) of adjacent vertices is maximised. This is a variant of obnoxious facility location problems or a dual problem to the cyclic bandwidth problem. The problem is NP-hard. In the paper we start investigating this invariant for typical graphs. We prove basic facts and exact results for meshes, tori and asymptotics for hypercubes.
منابع مشابه
Antibandwidth and cyclic antibandwidth of meshes and hypercubes
The antibandwidth problem consists of placing the vertices of a graph on a line in consecutive integer points in such a way that the minimum difference of adjacent vertices is maximized. The problem was originally introduced in [15] in connection with multiprocessor scheduling problems and can be also understood as a dual problem to the well known bandwidth problem, as a special radiocolouring ...
متن کاملAntibandwidth and Cyclic Antibandwidth of Hamming Graphs
The antibandwidth problem is to label vertices of graph G(V,E) bijectively by integers 0, 1, ..., |V |− 1 in such a way that the minimal difference of labels of adjacent vertices is maximised. In this paper we study the antibandwidth of Hamming graphs. We provide labeling algorithms and tight upper bounds for general Hamming graphs Πk=1Knk . We have exact values for special choices of ni’s and ...
متن کاملAntibandwidth of complete k-ary trees
The antibandwidth problem is to label vertices of a n-vertex graph injectively by 1, 2, 3, . . . n, so that the minimum difference between labels of adjacent vertices is maximised. The problem is motivated by the obnoxious facility location problem, radiocolouring, work and game scheduling and is dual to the well known bandwidth problem. We prove exact results for the antibandwidth of complete ...
متن کاملGRASP with path relinking heuristics for the antibandwidth problem
This paper proposes a linear integer programming formulation and several heuristics based on GRASP and path relinking for the antibandwidth problem. In the antibandwidth problem, one is given an undirected graph with n nodes and must label the nodes in a way that each node receives a unique label from the set {1, 2, . . . , n}, such that, among all adjacent node pairs, the minimum difference be...
متن کاملAntibandwidth of three-dimensional meshes
The antibandwidth problem is to label vertices of a graph G = (V, E) bijectively by 1, 2, 3, ..., |V | such that the minimal difference of labels of adjacent vertices is maximised. In this paper we discuss the antibandwidth of three-dimensional meshes. Provided results are extensions of the two-dimensional case and an analog of the result for the bandwidth of three-dimensional meshes obtained b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 22 شماره
صفحات -
تاریخ انتشار 2005